Exercise: Array-Based Lists

Solve a task regarding a more efficient implementation of the addAll() method in array-based lists.

We'll cover the following

Task

Task#

The List method addAll(i,c) inserts all elements of the Collection, c, into the list at position i. (The add(i, x) method is a special case where c = {x}.) It is not efficient to implement addAll(i,c) by repeated calls to add(i,x). Design and implement a more efficient implementation in which there is no repeated calls to the add(i,x) method.

Samle input

The sample input will be as follows:

list: 1 2 3
list2: 4 5 6

Expected output

The expected output will be as follows:

List elements:
1
4
5
6
2
3

main.py

base.py

utils.py

from utils import new_array
from base import BaseList
class ArrayList(BaseList):
    def __init__(self, t):
        self.a = []
        self.n = 0
    # Function to resize the array
    def resize(self):
        b = [None] * max(self.n * 2, 1)
        for i in range(self.n):
            b[i] = self.a[i]
        self.a = b
    # Function to get values
    def get(self, i):
        if i < 0 or i > self.n - 1:
            raise IndexError("Index out of bounds")
        return self.a[i]
    # Function to get size
    def size(self):
        return self.n
    # Function to add values
    def add(self, i, x):
        if i < 0 or i > self.n:
            raise IndexError("Index out of bounds")
        if self.n + 1 > len(self.a):
            self.resize()
        self.a.insert(i, x)
        self.n += 1
    # Function ot add all values
    def addAll1(self, idx, collection):

Enter to Rename, Shift+Enter to Preview

Task to implement an addAll2() method

Discussion on Array-Based Lists

Solution: Array-Based Lists